Two-layer channel routing with vertical unit-length overlap
نویسندگان
چکیده
منابع مشابه
Algorithms for Reducing Crosstalk in Two-Layer Channel Routing
Crosstalk minimization is one of the most important high performance aspects in interconnecting VLSI circuits. With advancement of fabrication technology, devices and interconnecting wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Crosstalk minimization problem for the reserved two-layer Manhattan channel routing ...
متن کاملParallel Algorithms for Single-Layer Channel Routing
We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that are known to have lineartime sequential solutions rather than limiting attention to the “river-routing” context, where single-sided connections are disallowed. For the minimum separation problem, we...
متن کاملSingle phase three-layer channel routing algorithms
We present a simple three-layer assignment algorithm for planar layouts generated by a class of layout algorithms. This class of algorithms includes simple variations of the following algorithms developed by Mehlhorn et al. (1986): (i) The algorithm that generates planar layouts for the two-terminal net CRP with dmax tracks. (ii) The algorithm that generates planar layouts for the twoand three-...
متن کاملMinimum Separation for Single-Layer Channel Routing
We provide a linear-time algorithm for determining the minimum separation required to route a channel when the connections can be realized in one layer. Differing from the usual “river-routing” context, we allow single-sided connections. The algorithm also works directly for problems with multiterminal nets and does not require wires to lie on an underlying grid, though it does use the rectilin...
متن کاملA Re-router for Reducing Wire Length in Multi-Layer No-Dogleg Channel Routing
The minimization of total wire length is one of the most key issue in VLSI physical design automation, as it reduces the cost of physical wiring required along with the electrical hazards of having long wires in the interconnection, power consumption, and signal propagation delay. So, it is still important as cost as well as high performance issue. The problem of reduced wire length routing sol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1986
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01840444